Back and forth bisimulations
ثبت نشده
چکیده
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that the back and forth variant of Milner's observation equivalence is different from (and finer than) observation equivalence. In fact we prove that it coincides with the branching bisimulation equivalence of Van Glabbeek & Weijland. Also the back and forth variants of branching, ~ and delay bisimulation lead to branching bisimulation equivalence. The notion of back and forth bisimulation moreover leads to characterizations of branching bisimulation in terms of abstraction homomorphisms and in terms of Hencessy-Milner logic with backward modalities. In our view these results support the claim that branching bisimulation is a natural and important notion.
منابع مشابه
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood s...
متن کاملNeighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood...
متن کاملMarch 4, 2010 ISOMORPHISM TYPES OF BOOLEAN ALGEBRAS IN THE BACK-AND-FORTH HIERARCHY
We investigate the back-and-forth types which isomorphism types. The main result is that the indecomposable isomorphism types which arise at the finite levels of the back-and-forth hierarchy are the same the finitary isomorphism types in Heindorff.
متن کاملUsing Bisimulations for Optimality Problems in Model Refinement
A known generic strategy for handling large transition systems is the combined use of bisimulations and refinement. The idea is to reduce the large system by means of a bisimulation quotient into a smaller one, then to refine the smaller one in such way that it fulfils a desired property, and then to expand this refined system back into a submodel of the original one. This generic algorithm is ...
متن کاملON THE n-BACK-AND-FORTH TYPES OF BOOLEAN ALGEBRAS
The objective of this paper is to uncover the structure of the back-andforth equivalence classes at the finite levels for the class of Boolean algebras. As an application, we obtain bounds on the computational complexity of determining the back-and-forth equivalence classes of a Boolean algebra for finite levels. This result has implications for characterizing the relatively intrinsically Σn re...
متن کامل